Needs are never demands
نویسندگان
چکیده
منابع مشابه
Why compensating fibre nonlinearity will never meet capacity demands
Current research efforts are focussed on overcoming the apparent limits of communication in single mode optical fibre resulting from distortion due to fibre nonlinearity. It has been experimentally demonstrated that this Kerr nonlinearity limit is not a fundamental limit; thus it is pertinent to review where the fundamental limits of optical communications lie, and direct future research on thi...
متن کاملInternet use among patients with psychosomatic disorders: what are the health-related demands and needs?
While Internet-based health-related offers for various disorders are increasing, little is known about the way patients with psychosomatic disorders use the Internet. We conducted a questionnaire survey in outpatient clinics at two university hospitals' Departments of Psychosomatic Medicine. Seventy-four percent of N = 274 patients had Internet home access and 60 percent of those patients repor...
متن کاملNeeds Assessment Competencies: Are They Important for Extension Educators?
The purpose of this study was to determine the importance of eleven professional competencies related to needs assessment and program development; a secondary purpose was to identify the best time these competencies should be learned. The study followed a survey research design, in which 441 randomly selected extension educators in the North Central Region of the United States responded to a qu...
متن کاملK-trivials Are Never Continuously Random
In [RS07, RS08], Reimann and Slaman raise the question “For which infinite binary sequences X do there exist continuous probability measures μ such that X is effectively random relative to μ?”. They defined the collection NCR1 of binary sequences for which such measures do not exist (we give formal definitions below), and showed, for example, that NCR1 is countable, indeed that every sequence i...
متن کاملRagnarok: RAndom Graphs Never ARe OK
Many researchers test graph scheduling algorithms on “random” graphs. We show that many of the random graphs used in the literature are not representative of actual programs by comparing random graphs to graphs derived from the SPECINT2000 benchmarks. We introduce Ragnarok (RAndom Graphs Never ARe OK), a new graph benchmark suite embodying characteristics of SPECINT2000 programs. We hope this b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1995
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.310.6985.1006c